Allocation of Periodic Hard Real-time Tasks
نویسنده
چکیده
In this paper, a static allocation (mapping) algorithm is described which handles periodic, hard real-time controller tasks. Our hybrid approach combines the advantages of constructive, and non-guided-search methods to overcome the problems of purely constructive , or purely non-guided-search techniques. The new method is motivated by the connguration of a parallel real-time operating system to manage very complex control applications. The goal of the connguration is to reduce OS overhead as much as possible. It is achieved by allocating the controller tasks to the processor network in advance. Following this approach the advantages of special purpose processors (no overhead) and OS driven computers (good utilisation) are combined.
منابع مشابه
A Heuristic Approach to Task Allocation in Real- Time Distributed Systems
The task scheduling problem consists in defining a time sharing of system resources that can meet all logical and temporal constraints of the tasks being considered. In real-time distributed systems such a problem can be broken up in two related steps: task allocation and local task scheduling. Task allocation can be performed dynamically or statically. For tasks with predictable behavior (peri...
متن کاملCHaRy: the C-LAB hard real-time system to support mechatronical design
CHaRy is a software system to support the synthesis of periodic controller applications, where hard real-time conditions must be guaranteed for software tasks. Due to complexity reasons, CHaRy decomposes the overall problem of implementing periodic controllers on parallel embedded computers to the sub-problems partitioning, timing analysis, allocation and schedulability analysis. This rigourous...
متن کاملAn Efficient Scheme to Allocate Soft-Aperiodic Tasks in Multiprocessor Hard Real-Time Systems
We propose a scheme to allocate individual softaperiodic tasks in a shared memory symmetrical multiprocessor for hard-real time systems applications. The aim of this scheme is to minimize the aperiodic mean response time by running a local uniprocessor scheduler to serve periodic tasks guaranteeing their deadlines, and serving aperiodic tasks with a global scheduler that uses different allocati...
متن کاملAllocating Hard Real-Time Tasks with Constraint Programming
In this paper, we present an original approach (CPRTA for ”Constraint Programming for solving Real-Time Allocation”) based on constraint programming to solve an allocation problem of hard real-time tasks. This problem consists in assigning periodic tasks to distributed processors in the context of fixed priority preemptive scheduling. CPRTA is built on dynamic constraint programming together wi...
متن کامل